Existing certificateless proxy signature schemes based on classical number theory problem assumptions cannot resist to quantum computer attacks， and when these schemes are applied to systems with a large number of users， there are limitations such as single point of failure and low scalability. Aiming at these problems， a lattice-based hierarchical certificateless proxy signature scheme was proposed. Firstly， the rejection sampling technology and trapdoor-free technology were used to improve the computational efficiency of key generation. Secondly， the mutual authentication was performed by the original signers and proxy signers at different levels by exchanging randomly selected matrices， and then the proxy authorization was realized. Finally， the security of this scheme was proved under the of the Small Integer Solution （SIS） hard problem assumption in the random oracle model. Compared with the existing proxy signature schemes， the proposed scheme allows signers coming from different levels and belonging to different Key Generation Centers （KGCs）. The performance evaluation experimental results show that in the proposed scheme， the public key size is a constant， the overhead of proxy signature and verification is independent of the level， and the proxy key size and the signature size are not hierarchical linear quantities， so that this scheme can better meet the needs of large-scale distributed heterogeneous networks for load balancing， and is efficient and feasible.

In the process of indoor positioning and navigation, a Bayesian network-based floor localization algorithm was proposed for the problem of large error of floor localization when only the pedestrian height displacement considered. Firstly, Extended Kalman Filter (EKF) was adopted to calculate the vertical displacement of the pedestrian by fusing inertial sensor data and barometer data. Then, the acceleration integral features after error compensation was used to detect the corner when the pedestrian went upstairs or downstairs. Finally, Bayesian network was introduced to locate the pedestrian on the most likely floor based on the fusion of walking height and corner information. Experimental results show that, compared with the floor localization algorithm based on height displacement, the proposed algorithm has improved the accuracy of floor localization by 6.81%; and compared with the detection algorithm based on platform, the proposed algorithm has improved the accuracy of floor localization by 14.51%. In addition, the proposed algorithm achieves the accuracy of floor localization by 99.36% in the total 1247 times floor changing experiments.

In the traditional indoor pedestrian positioning algorithm based on dead reckoning and Kalman filtering, there is a problem of cumulative error in the heading angle, which makes the positional error continue to accumulate continuously. To solve this problem, a pedestrian heading particle filter algorithm with indoor environment constraints was proposed to correct direction error. Firstly, the indoor map information was abstracted into a structure represented by line segments, and the map data was dynamically integrated into the mechanism of particle compensation and weight allocation. Then, the heading self-correction mechanism was constructed through the correlation map data and the sample to be calibrated. Finally, the distance weighting mechanism was constructed through correlation map data and particle placement. In addition, the particle filter model was simplified, and heading was used as the only state variable to optimize. And while improving the positioning accuracy, the dimension of state vector was reduced, thereby the complexity of data analysis and processing was reduced. Through the integration of indoor environmental information, the proposed algorithm can effectively suppress the continuous accumulation of directional errors. The experimental results show that, compared with the traditional Kalman filter algorithm, the proposed algorithm can significantly improve the pedestrian positioning accuracy and stability. In the two-dimensional walking experiment with a distance of 435 m, the heading angle error is reduced from 15.3° to 0.9°, and the absolute error at the end position is reduced from 5.50 m to 0.87 m.

To solve the problem of node's premature death in existing power control methods for Wireless Sensor Network (WSN), a new method called Self-Adaptive Fuzzy Control (SAFPC) was proposed. Firstly, the model of two level fuzzy controller with "input-output-feedback" mechanism was designed, whose main controller was responsible for the node transmission power adjustment, and auxiliary controller was responsible for the desired node degree adjustment, so as to adjust the transmission power adaptively according to the residual energy of the node. Secondly, the fuzzification, fuzzy rules and defuzzification process were described in detail. Finally, SAFPC was simulated and analyzed in terms of network convergence time, average energy consumption and network life cycle. The experimental results show that, compared with FCTP (Fuzzy Control Transmission Power method), SAFPC can increase convergence rate by 12.5%, the average energy consumption of the nodes is reduced by 3.68% and the network life cycle is prolonged by 7.9%. It can be seen that SAFPC can effectively prolong the network life cycle, as well as improve network dynamic adaptability and link robustness significantly.